#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
#define rep(i, a, b) for (int i = (a); i <= (b); i++)
#define per(i, a, b) for (int i = (a); i >= (b); i--)
#define endl '\n'
const int N = 2e5 + 5;

int n, m;
int a[N];
int gcd(int a, int b) { return b == 0 ? a : gcd(b, a % b); }
void solve() {
  int x, y;
  cin >> n >> m >> x >> y;
  // if (n < m && x > y) swap(x, y);
  // if (n > m && x < y) swap(x, y);
  int d = gcd(x, y);
  x /= d, y /= d;
  int k = min(n / x, m / y);
  cout << k * x << ' ' << k * y << endl;
  return;
}
int main() {
  ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
  int t;
  t = 1;
  while (t--) solve();
  return 0;
}